On some computational orders of convergence

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A study on new computational local orders of convergence

Four new variants of the Computational Order of Convergence (COC) of a one-point iterative method with memory for solving nonlinear equations are presented. Furthermore, the way to approximate the new variants to the local order of convergence is analyzed. Three of the new definitions given here do not involve the unknown root. Numerical experiments using adaptive arithmetic with multiple preci...

متن کامل

Some results on convergence and existence of best proximity points

In this paper, we introduce generalized cyclic φ-contraction maps in metric spaces and give some results of best proximity points of such mappings in the setting of a uniformly convex Banach space. Moreover, we obtain convergence and existence results of proximity points of the mappings on reflexive Banach spaces

متن کامل

Convergence and fixed points by fuzzy orders

A general approach to fixed point theory is proposed which is related to the notion of fuzzy ordering. This approach extends both the fixed point theorems in metric spaces and the ones in ordered sets. © 2007 Elsevier B.V. All rights reserved.

متن کامل

Some Restrictions on Orders of Abelian Planar Difference Sets

The Prime Power Conjecture (PPC) states that abelian planar difference sets of order n exist only for n a prime power. Lander and others have shown that orders divisible by certain composites can be eliminated. In this paper we show how to extend this list of excluded orders.

متن کامل

On 2-adic Orders of Some Binomial Sums

We prove that for any nonnegative integers n and r the binomial sum n ∑ k=−n ( 2n n− k ) k is divisible by 22n−min{α(n),α(r)}, where α(n) denotes the number of 1s in the binary expansion of n. This confirms a recent conjecture of Guo and Zeng [J. Number Theory, 130(2010), 172–186]. In 1976 Shapiro [3] introduced the Catalan triangle ( k n ( 2n n−k ) )n>k>1 and determined the sum of entries in t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2010

ISSN: 0893-9659

DOI: 10.1016/j.aml.2009.12.006